منابع مشابه
The Order of Death of Organisms Larger than Bacteria
In a previous paper it has been shown that the logarithmic order of death of bacteria can be accounted for by the assumption of some very unstable molecules so essential for reproduction that the inactivation of only one such molecule per cell prevents reproduction and makes the cell appear "dead" according to the standard method of counting living bacteria. In the present paper dealing with th...
متن کاملLarger, smaller, odd or even? Task-specific effects of optokinetic stimulation on the mental number space
Larger, smaller, odd or even? Task-specific effects of optokinetic stimulation on the mental number space Mariagrazia Ranzini, Matteo Lisi, Elvio Blini, Marco Pitteri, Barbara Treccani, Konstantinos Priftis & Marco Zorzi a Centre de Recherche Cognition & Neurosciences (CRCN), FNRS-ULB Université Libre de Bruxelles, Bruxelles, Belgium b Laboratoire Psychologie de la Perception, Université Paris ...
متن کاملFinite groups have even more centralizers
For a finite group $G$, let $Cent(G)$ denote the set of centralizers of single elements of $G$. In this note we prove that if $|G|leq frac{3}{2}|Cent(G)|$ and $G$ is 2-nilpotent, then $Gcong S_3, D_{10}$ or $S_3times S_3$. This result gives a partial and positive answer to a conjecture raised by A. R. Ashrafi [On finite groups with a given number of centralizers, Algebra Collo...
متن کاملMaking Even Swaps Even Easier
This paper introduces an approach to support different phases of the Even Swaps process by Preference Programming, which is a framework for modeling incomplete information within multiattribute value theory. In the approach, the Even Swaps process is carried out as usual, but in parallel the preferences of the decision maker are modeled with a Preference Programming model, which is also updated...
متن کاملFinding Even Cycles Even Faster
We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k ≥ 2, there is an O(V ) time algorithm that decides whether an undirected graph G = (V,E) contains a simple cycle of length 2k and finds one if it does. (ii) There is an O(V ) time algorithm that finds a shortest even cycle in an undirected graph G = (V,E).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1992
ISSN: 0028-0836,1476-4687
DOI: 10.1038/360216a0